Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

We propose a sound, complete, and automatic method for pairwise reachability analysis of higher-order concurrent programs with recursion, nested locks, joins, and dynamic thread creation. The method is based on a reduction to higher-order model checking (i.e., model checking of trees generated by higher-order recursion schemes). It can be considered an extension of Gawlitz et al.’s work on the join-lock-sensitive reachability analysis for dynamic pushdown networks (DPN) to higherorder programs. To our knowledge, this is the first application of higherorder model checking to sound and complete verification of (reasonably expressive models of) concurrent programs.